Computation Alignment: Capacity Approximation Without Noise Accumulation
نویسندگان
چکیده
منابع مشابه
Stochastic neural computation without noise
Neural-network models of high-level brain functions such as memory recall and reasoning often rely on the presence of stochasticity. The majority of these models assumes that each neuron in the functional network is equipped with its own private source of randomness, often in the form of uncorrelated external noise. However, both in vivo and in silico, the number of noise sources is limited due...
متن کاملApproximation Bayesian Computation.
Approximation Bayesian computation [ABC] is an analysis approach that has arisen in response to the recent trend to collect data that is of a magnitude far higher than has been historically the case. This has led to many existing methods become intractable because of difficulties in calculating the likelihood function. ABC circumvents this issue by replacing calculation of the likelihood with a...
متن کاملComputation,Approximation andStability ofExplicit
This paper presents an approximate multi-parametric Nonlinear Programming (mp-NLP) approach to explicit solution of feedback min-max NMPC problems for constrained nonlinear systems in the presence of bounded disturbances and/or parameter uncertainties. It is based on an orthogonal search tree structure of the state space partition and consists in constructing a piecewise nonlinear (PWNL) approx...
متن کاملComputation of capacity
This article introduces a method for computing upper and lower bounds for the logarithmic capacity of a compact plane set. If the set has the Hölder continuity property, then these bounds converge to the value of the capacity. A number of examples are discussed in detail, including the Cantor middle-third set, for which we estimate c(E) ≈ 0.220949102189507.
متن کاملManifold Alignment without Correspondence
Manifold alignment has been found to be useful in many areas of machine learning and data mining. In this paper we introduce a novel manifold alignment approach, which differs from “semisupervised alignment” and “Procrustes alignment” in that it does not require predetermining correspondences. Our approach learns a projection that maps data instances (from two different spaces) to a lower dimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2245937